Weak Second Order Characterizations of Various Program Verification Systems

نویسندگان

  • Johann A. Makowsky
  • Ildikó Sain
چکیده

We show the equivalence (!{ LeivIIlII' .1' dUlfl/r;wr;zmion of Floyd-Hoare Logic in weak second order logic (fLeSSJ) with both Csirltl(lZ'S (f Cs80I) 111/(/ Selin's (f Sa85bJ) characterizations of Floyd-Hoare logic in Nonstandard Logics of Programs, Ow method allows us u) spell out tlJ.e precise role of the comprehension axiom in weak second order [og;I:. Ii .(~ then prove similar resultsIor other program verification systems (suggested by Barstllll fwd f'l1uclii and identify exactly the comprehension axioms corresponding to those systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Theories and Proof Systems for PSPACE and the EXP - Time Hierarchy

Theories and Proof Systems for PSPACE and the EXP-Time Hierarchy Alan Ramsay Skelley Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2006 This dissertation concerns theories of bounded arithmetic and propositional proof systems associated with PSPACE and classes from the exponential-time hierarchy. The second-order viewpoint of Zambella and Cook associates sec...

متن کامل

On characterizations of the fully rational fuzzy choice functions

In the present paper, we introduce the fuzzy Nehring axiom, fuzzy Sen axiom and weaker form of the weak fuzzycongruence axiom. We establish interrelations between these axioms and their relation with fuzzy Chernoff axiom. Weexpress full rationality of a fuzzy choice function using these axioms along with the fuzzy Chernoff axiom.

متن کامل

Various kinds of regular injectivity for $S$-posets

‎In this paper some properties of weak regular injectivity for $S$-posets‎, ‎where $S$ is a pomonoid‎, ‎are studied‎. ‎The behaviour‎ ‎of different kinds of weak regular injectivity with products‎, ‎coproducts and direct sums is considered‎. ‎Also‎, ‎some‎ ‎characterizations of pomonoids over which all $S$-posets are of‎ ‎some kind of weakly regular injective are obtained‎. ‎Further‎, ‎we‎ ‎giv...

متن کامل

Dual Characterizations of Set Containments with Strict Convex Inequalities

Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a …nite union of convex sets (i.e. the set, described by reverse-convex inequalities) are given. These characterizations provide ways of verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated systems. The conv...

متن کامل

Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs

We provide several effective equivalent characterizations of EF (the modal logic of the descendant relation) on arbitrary trees. More specifically, we prove that, for EF-bisimulation invariant properties of trees, being definable by an EF formula, being a Borel set, and being definable in weak monadic second order logic, all coincide. The proof builds upon a known algebraic characterization of ...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 66  شماره 

صفحات  -

تاریخ انتشار 1989